Cyclotron Resonance Study of the Two-Dimensional Electron Layers and Double-Layers in Tilted Magnetic Fields

The far-infrared absorption in two-dimensional electron layers subject to magnetic field of general orientation was studied theoretically. The Kubo formula is employed to derive diagonal components of the magneto-conductivity tensor of two-dimensional electron single-layers and double-layers. The parabolic quantum well is used to model a simple single-layer system. Both single-layer and double-layer systems can be realized in a pair of tunnel-coupled, strictly two-dimensional quantum wells. Obtained results are compared to experimental data.Comment: 4 pages, 6 figures, elsart/PHYEAUTH macros; presented on the EP2DS-15 Conference in Nara, Japan. To be published in Physica

Minimizing Running Costs in Consumption Systems

A standard approach to optimizing long-run running costs of discrete systems is based on minimizing the mean-payoff, i.e., the long-run average amount of resources ("energy") consumed per transition. However, this approach inherently assumes that the energy source has an unbounded capacity, which is not always realistic. For example, an autonomous robotic device has a battery of finite capacity that has to be recharged periodically, and the total amount of energy consumed between two successive charging cycles is bounded by the capacity. Hence, a controller minimizing the mean-payoff must obey this restriction. In this paper we study the controller synthesis problem for consumption systems with a finite battery capacity, where the task of the controller is to minimize the mean-payoff while preserving the functionality of the system encoded by a given linear-time property. We show that an optimal controller always exists, and it may either need only finite memory or require infinite memory (it is decidable in polynomial time which of the two cases holds). Further, we show how to compute an effective description of an optimal controller in polynomial time. Finally, we consider the limit values achievable by larger and larger battery capacity, show that these values are computable in polynomial time, and we also analyze the corresponding rate of convergence. To the best of our knowledge, these are the first results about optimizing the long-run running costs in systems with bounded energy stores.Comment: 32 pages, corrections of typos and minor omission

Arithmetic complexity via effective names for random sequences

We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr, and Kurtz random sets, weakly 1-generics and their complementary classes, we find that there exist characterizations of the third and fourth levels of the arithmetic hierarchy purely in terms of these notions. More generally, there exists an equivalence between arithmetic complexity and existence of numberings for classes of left-r.e. sets with shift-persistent elements. While some classes (such as Martin-L\"{o}f randoms and Kurtz non-randoms) have left-r.e. numberings, there is no canonical, or acceptable, left-r.e. numbering for any class of left-r.e. randoms. Finally, we note some fundamental differences between left-r.e. numberings for sets and reals

Finite settling time stabilisation: the robust SISO case

This article deals with the problem of robustness to multiplicative plant perturbations for the case of finite settling time stabilisation (FSTS) of single input single output (SISO), linear, discrete-time systems. FSTS is a generalisation of the deadbeat control and as in the case of deadbeat control the main feature of FSTS is the placement of all closed-loop poles at the origin of the z-plane. This makes FSTS sensitive to plant perturbations hence, the need of robust design. An efficient robustness index is introduced and the problem is reduced to a finite linear programme where all the benefits of the simplex method, such as effectiveness, efficiency and ability to provide complete solution to the optimisation problem, can be exploited

Contextual diversity, not word frequency, determines word-naming and lexical decision times

Word frequency is an important predictor of word-naming and lexical decision times. It is, however, confounded with contextual diversity, the number of contexts in which a word has been seen. In a study using a normative, corpus-based measure of contextual diversity, word-frequency effects were eliminated when effects of contextual diversity were taken into account (but not vice versa) across three naming and three lexical decision data sets; the same pattern of results was obtained regardless of which of three corpora was used to derive the frequency and contextual-diversity values. The results are incompatible with existing models of visual word recognition, which attribute frequency effects directly to frequency, and are particularly problematic for accounts in which frequency effects reflect learning. We argue that the results reflect the importance of likely need in memory processes, and that the continuity between reading and memory suggests using principles from memory research to inform theories of reading

On The Impact of Passive Voice Requirements on Domain Modelling

Context: The requirements specification is a central arte- fact in the software engineering (SE) process, and its quality (might) influence downstream activities like implementation or testing. One quality defect that is often mentioned in standards is the use of passive voice. However, the con- sequences of this defect are still unclear. Goal: We need to understand whether the use of passive voice in requirements has an influence on other activities in SE. In this work we focus on domain modelling. Method: We designed an experiment, in which we ask students to draw a domain model from a given set of requirements written in active or passive voice. We compared the completeness of the resulting domain model by counting the number of missing actors, domain objects and their associations with respect to a specified solution. Results: While we could not see a difference in the number of missing actors and objects, participants which received passive sentences missed almost twice the associations. Conclusion: Our experiment indicates that, against common knowledge, actors and objects in a requirement can often be understood from the context. However, the study also shows that passive sentences complicate understanding how certain domain concepts are interconnected